Graph Grammar Based Direct Solver for Hp-adaptive Finite Element Method with Point Singularities
نویسندگان
چکیده
In this paper we present a graph grammar based direct solver algorithm for hp-adaptive finite element method simulations with point singularities. The solver algorithm is obtained by representing computational mesh as a graph and prescribing the solver algorithm by graph grammar productions. Classical direct solvers deliver O(Np+N) computational cost for regular 2D grids, and O(Np+N) for regular 3D grids, where N denotes number of degrees of freedom and p denotes the polynomial order of approximation. The solver presented in this paper delivers linear computational cost for uniform polynomial order of approximation p. For non-uniform polynomial order the computational cost is almost linear.
منابع مشابه
Graph Grammar based Multi-thread Multi-frontal Direct Solver with Galois Scheduler
In this paper, we present a multi-frontal solver algorithm for the adaptive finite element method expressed by graph grammar productions. The graph grammar productions construct first the binary elimination tree, and then process frontal matrices stored in distributed manner in nodes of the elimination tree. The solver is specialized for a class of one, two and three dimensional h refined meshe...
متن کاملAlgorytm Solvera Dokładnego Sterowany Siecią Petriego Wykorzystujący Gramatyki Grafowe
In this paper we present the Petri net setting the optimal order of elimination for direct solver working with hp refined finite finite element meshes. The computational mesh is represented by a graph, with graph vertices corresponding to finite element nodes. The direct solver algorithm is expressed as a sequence of graph grammar productions, attributing the graph vertices. The Petri net dicta...
متن کاملA Graph Grammar Model of the hp Adaptive Three Dimensional Finite Element Method. Part I
The first part of our paper presents a composite programmable graph grammar model for the self-adaptive two dimensional hp Finite Element Method algorithms (2D hp-FEM) with mixed triangular and rectangular finite elements. The two dimensional model is a starting point for the three dimensional model of self-adaptive hp-FEM presented in the second part of this paper. A computational mesh is repr...
متن کاملA Graph Grammar Model of the hp Adaptive Three Dimensional Finite Element Method. Part II
This paper presents a composite programmable graph grammar model of the three dimensional self-adaptive hp Finite Element Method (hp-FEM) algorithms. The computational mesh composed of hexahedral finite elements is represented by a composite graph. The operations performed over the mesh are expressed by composite graph grammar productions. The three dimensional model is based on the extension o...
متن کاملGraph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis
This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence ...
متن کامل